New Public Key Cryptosystem Using Finite Non Abelian Groups
نویسندگان
چکیده
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. It is convertible to a scheme in which the encryption and decryption are much faster than other well-known public key cryptosystems, even without no message expansion. Furthermore a signature scheme can be easily derived from it, while it is difficult to find a signature scheme using a non abelian group.
منابع مشابه
On public-key cryptosystem MST3 and its realization
8th Central European Conference on Cryptography 2008 1 versions. Finally, we discuss the choice of suitable parameters for an efficient realization of thesystem and its practical usage.References [1] S. S. Magliveras, D. R. Stinson and Tran van Trung, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, J. Cryptology, 15 (2002), 28...
متن کاملSecurity Analysis of the MOR Cryptosystem
The paper cryptanalyses a new public key cryptosystem that has been recently proposed by Paeng, Ha, Kim, Chee and Park [5]. The scheme works on finite non-abelian groups. We focus on the group SL(2, ZZp)×θ ZZp which was discussed in [5] extensively.
متن کاملPublic key cryptosystem and a key exchange protocol using tools of non-abelian group
Abstract. Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper tria...
متن کاملDesign und Analyse kryptografischer Bausteine auf nicht-abelschen Gruppen
English Abstract Public-key cryptography enables two (or more) parties to execute cryptographic protocols (e.g. to send confidential messages) without requiring a common secret. The methods in use today are mostly based on abelian groups (see [35] for example). Recently, several cryptographic protocols using non-abelian groups were proposed [23, 42]. The underlying security assumption on which ...
متن کامل